Co-expression networks: graph properties and topological comparisons
نویسندگان
چکیده
منابع مشابه
Co-expression networks: graph properties and topological comparisons
MOTIVATION Microarray-based gene expression data have been generated widely to study different biological processes and systems. Gene co-expression networks are often used to extract information about groups of genes that are 'functionally' related or co-regulated. However, the structural properties of such co-expression networks have not been rigorously studied and fully compared with known bi...
متن کاملDistance-Based Topological Indices and Double graph
Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
متن کاملTopological Properties of Co-Occurrence Networks in Published Gene Expression Signatures
Meta-analysis of high-throughput gene expression data is often used for the interpretation of proprietary gene expression data sets. We have recently shown that co-occurrence patterns of gene expression in published cancer-related gene expression signatures are reminiscent of several cancer signaling pathways. Indeed, significant co-occurrence of up to ten genes in published gene expression sig...
متن کاملApplication of Graph Theory to Some Thermodynamic Properties and Topological Indices
The relationship between the Randic , Wiener, Hosoya , Balaban, Schultz indices, Harary numbers andDistance matrix to enthalpies of formation (Airf), heat capacity, (Cp) , enthalpies of combustion (AH °c ),enthalpy of vaporization (AH °vap) and normal boiling points (bpK)of C2 C10 normal alkanes isrepresented
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2009
ISSN: 1460-2059,1367-4803
DOI: 10.1093/bioinformatics/btp632